منابع مشابه
Pairs of edges as chords and as cut-edges
Several authors have studied the graphs for which every edge is a chord of a cycle; among 2-connected graphs, one characterization is that the deletion of one vertex never creates a cut-edge. Two new results: among 3-connected graphs with minimum degree at least 4, every two adjacent edges are chords of a common cycle if and only if deleting two vertices never creates two adjacent cut-edges; am...
متن کاملOn the variable sum exdeg index and cut edges of graphs
The variable sum exdeg index of a graph G is defined as $SEI_a(G)=sum_{uin V(G)}d_G(u)a^{d_G(u)}$, where $aneq 1$ is a positive real number, du(u) is the degree of a vertex u ∈ V (G). In this paper, we characterize the graphs with the extremum variable sum exdeg index among all the graphs having a fixed number of vertices and cut edges, for every a>1.
متن کاملCut edges and surface characteristics produced by different microkeratomes.
PURPOSE To determine the cutting characteristics of seven different microkeratomes and to compare the cut edges and surface characteristics of the corneas with respect to different keratome parameters, ie, blade oscillation frequencies and keratome speed. METHODS Lamellar keratectomies were performed using each microkeratome on eight freshly enucleated porcine corneas. The freshly cut corneal...
متن کاملOn the spectral moment of graphs with k cut edges
Let A(G) be the adjacency matrix of a graph G with λ1(G), λ2(G), . . . , λn(G) its eigenvalues in non-increasing order. Call the number Sk(G) := ∑ n i=1 λ i (G) (k = 0, 1, . . . , n − 1) the kth spectral moment of G. Let S(G) = (S0(G), S1(G), . . . , Sn−1(G)) be the sequence of spectral moments of G. For two graphsG1 and G2, we have G1 ≺s G2 if Si(G1) = Si(G2) for i = 0, 1, . . . , k−1 and Sk(G...
متن کاملOn the spectral radius of graphs with cut edges
We study the spectral radius of graphs with n vertices and k cut edges. In this paper, we show that of all the connected graphs with n vertices and k cut edges, the maximal spectral radius is obtained uniquely at Kk n , where K k n is a graph obtained by joining k independent vertices to one vertex of Kn−k . We also discuss the limit point of the maximal spectral radius. © 2004 Elsevier Inc. Al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2014
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1755